#include"Heap_qsort.h"
int main()
{
	Heap obj;
	HeapInit(&obj);
	int arr[100000] = {0};
	clock_t start, end;
	for (int i = 0; i < 100000; i++)
	{
		arr[i] = i;
	}
	start = clock();
	//HeapSort(arr, sizeof(arr)/sizeof(arr[0]));
	BubbleSort(arr, sizeof(arr) / sizeof(arr[0]));
	end = clock();
	printf("%d", end - start);
	/*for (int i = 0; i < sizeof(arr) / sizeof(arr[0]); i++)
	{
		printf("%d ", arr[i]);
	}*/
	return 0;
}